#include <bits/stdc++.h>
using namespace std;

int main (){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);

    int n;
    cin >>n;
    int a[100010];
    a[0]=-1;
    for ( int i = 1 ; i <= n ; i++ ){
        cin >>a[i];
    }
    sort(a+1,a+n+1);
    int m=a[1],being=0,doing=0;
    for ( int i = 1 ; i <= n ; i++ ){
        if (m==a[i]){
            doing++;
        }
        else{
            m=a[i];
            //cout <<doing<<" "<<being<<endl;
            being=max(doing,being);
            doing=1;
        }
    }
    cout <<max(being,doing)<<endl;

    return 0;
}
